Notes on Computer Theory Last updated : September , 2015 Space complexity
نویسنده
چکیده
Recall that when defining the space complexity of a language, we look at the number of cells required on the work tapes of a turing machine that decides the language. In particular, we do not care about the number of cells required to represent the input or output of the computation: this will allow us to compute functions in sub-linear space. Just as in the case of time complexity, we will also consider the space complexity of non-deterministic turing machines. In direct analogy to time complexity, we consider the space of a non-deterministic machine to be the amount of space used in the worst-case over the choices of state transitions. We now define some of the important space-complexity classes we will study:
منابع مشابه
Notes on Complexity Theory Last updated : September , 2015 Lecture 5
Recall that when defining the space complexity of a language, we look at the number of cells required on the work tapes of a turing machine that decides the language. In particular, we do not care about the number of cells required to represent the input or output of the computation: this will allow us to compute functions in sub-linear space. Just as in the case of time complexity, we will als...
متن کاملNotes on Complexity Theory Last updated : September 14 , 2011 Lecture 5
We know that there existNP-complete languages. Assuming P 6= NP, any NP-complete language lies in NP \ P. Are there languages that are neither in P nor NP-complete? Ladner’s theorem tells us that there are. As some intuition for Ladner’s theorem, take some language L ∈ NP \ P. Using padding, we will make L “easy enough” so that it can’t be NP-complete, while keeping it “hard enough” so it is no...
متن کاملAnt Colony Optimization and Swarm Intelligence, 6th International Conference, ANTS 2008, Brussels, Belgium, September 22-24, 2008. Proceedings
New updated! The ant colony optimization and swarm intelligence 6th international conference ants 2008 brussels belgium september 22 24 2008 proceedings lecture notes in computer science from the best author and publisher is now available here. This is the book that will make your day reading becomes completed. When you are looking for the printed book of this PDF in the book store, you may not...
متن کاملGrothendieck ’ s Theorem , past and present UNCUT updated and still expanding
Probably the most famous of Grothendieck’s contributions to Banach space theory is the result that he himself described as “the fundamental theorem in the metric theory of tensor products”. That is now commonly referred to as “Grothendieck’s theorem” (GT in short), or sometimes as “Grothendieck’s inequality”. This had a major impact first in Banach space theory (roughly after 1968), then, later...
متن کاملNotes on Complexity Theory Last updated : November , 2011 Lecture 25
Randomization provides unconditional benefits in many settings; examples include cryptography (where random keys are used to provide protection against an adversary) and distributed computing (where randomness can be used as a means to break symmetry between parties). Randomness also appears to help in algorithm design. But is it possible that, from a complexity-theoretic perspective, randomnes...
متن کامل